Efficient Dynamic Index Structure for SSD (SPM)
نویسندگان
چکیده
منابع مشابه
Log-Compact R-Tree: An Efficient Spatial Index for SSD
R-Tree structure is widely adopted as a general spatial index with the assumption that the deployed system is equipped with magnetic hard disk. While the application of SSD becomes more and more popular, traditional optimization of R-Tree structure on SSD is much less desirable than that on magnetic hard disk. Existing flash-aware index approaches employ log mechanism to reduce random writes at...
متن کاملAn Efficient Dynamic Hash Index Structure for NAND Flash Memory
We propose an efficient dynamic hash index structure suitable for a NAND flash memory environment. Since write operations incur significant overhead in NAND flash memory, our design of index structure focuses on minimizing the number of write operations for hash index updates. Through a set of extensive experiments, we show the effectiveness of the proposed hash index structure in a NAND flash ...
متن کاملDynamic Forest: An Efficient Index Structure for NAND Flash Memory
In this paper, we present an efficient index structure for NAND flash memory, called the Dynamic Forest (D-Forest). Since write operations incur high overhead on NAND flash memory, D-Forest is designed to minimize write operations for index updates. The experimental results show that D-Forest significantly reduces write operations compared to the conventional B+-tree. key words: NAND flash memo...
متن کاملMalmquist Productivity Index with Dynamic Network Structure
Data envelopment analysis (DEA) measures the relative efficiency of decision making units (DMUs) with multiple inputs and multiple outputs. DEA-based Malmquist productivity index measures the productivity change over time. We propose a dynamic DEA model involving network structure in each period within the framework a DEA. We have previously published the network DEA (NDEA) and the dynamic DEA ...
متن کاملAn Efficient Index Structure for String Databases
We consider the problem of substring searching in large databases. Typical applications of this problem are genetic data, web data, and event sequences. Since the size of such databases grows exponentially, it becomes impractical to use inmemory algorithms for these problems. In this paper, we propose to map the substrings of the data into an integer space with the help of wavelet coefficients....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2010
ISSN: 1598-4877
DOI: 10.5392/jkca.2010.10.2.054